Hit-or-Miss Dependence of Random Closed Sets

نویسندگان

  • Haijun Li
  • Susan H. Xu
  • Way Kuo
چکیده

The notion of hit-or-miss dependence is introduced to describe spatial dependence of random closed sets, and its closure properties under various set operations are derived. The hit-or-miss dependence is then applied to Boolean germ-grain models to study local interactions within each grain. The dependence comparison results obtained not only show how local interactions of Boolean germ-grain models would affect system performance, but also yield various bounds for spatial reliability indexes, which can be calculated explicitly.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Legume Identification by Leaf Vein Images Classification

In this paper we propose an automatic algorithm able to classify legume leaf images considering only the leaf venation patterns (leaf shape, color and texture are excluded). This method processes leaf images captured with a standard scanner and segments the veins using the Unconstrained Hit-or-Miss Transform (UHMT) and adaptive thresholding. We measure several morphological features on the vein...

متن کامل

Propagation Models and Fitting Them for the Boolean Random Sets

In order to study the relationship between random Boolean sets and some explanatory variables, this paper introduces a Propagation model. This model can be applied when corresponding Poisson process of the Boolean model is related to explanatory variables and the random grains are not affected by these variables. An approximation for the likelihood is used to find pseudo-maximum likelihood esti...

متن کامل

Hashed Addressed Caches for Embedded Pointer Based Codes (Research Note)

We are proposing a cache addressing scheme based on hash-ing intended to decrease the miss ratio of small size caches. The main intention is to improve the hit ratio for 'random' patterns pointer memory accesses for embedded (special purpose) system applications. We introduce a hashing scheme, denoted as bit juggling, and measure the eeect such a scheme has in the cache access miss ratio. It is...

متن کامل

STT-RAM, SRAM, BRAM, ReRAM, and eDRAM Analysis of Their Advantages and Disadvantages

Multilevel cache became an essential part of improving processor performance as well as keeping the costs of manufacturing down. In this paper we will analyze ten different cache configurations that include SRAM, STT-RAM, ReRAM, eDRAM, and BRAM. We are going to analyze their advantages and disadvantages over one another and compare their energy consumption and cache latency. We will also cover ...

متن کامل

Some Generalizations of Locally Closed Sets

Arenas et al. [1] introduced the notion of lambda-closed sets as a generalization of locally closed sets. In this paper, we introduce the notions of lambda-locally closed sets, Lambda_lambda-closed sets and lambda_g-closed sets and obtain some decompositions of closed sets and continuity in topological spaces.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010